Source coding, large deviations, and approximate pattern matching

Source coding, large deviations, and approximate pattern matching

In this review paper, we present a development of parts of rate-distortion theory and pattern-matching algorithms for lossy data compression, centered around a lossy version of the asymptotic equipartition property (AEP). This treatment closely parallels the corresponding development in lossless compression, a point of view that was advanced in an important paper of Wyner and Ziv in 1989. In th...

Sour e Coding , Large Deviations , and Approximate Pattern Mat hingA

Weighted Degenerated Approximate Pattern Matching

We present a bit-parallel approach to degenerated approximate pattern matching problem. That is the problem of finding approximate matches of a “special” pattern in a text of degenerate symbols. The special pattern P = s1 ∗ (a1,b1) . . . sl ∗ (al,bl) sl+1 ∗ (al+1,bl+1) . . . sω, such that symbol ∗ (a,b) is a sequence of at most b but at least a “don’t care” symbols which match any symbol within...

Approximate Pattern Matching with Samples

We simplify in this paper the algorithm by Chang and Lawler for the approximate string matching problem, by adopting the concept of sampling. We have a more general analysis of expected time with the simpli ed algorithm for the one-dimensional case under a non-uniform probability distribution, and we show that our method can easily be generalized to the two-dimensional approximate pattern match...

Approximate Pattern Matching in Nanotechnology

Approximate pattern matching is comparing an unknown pattern with a database of stored patterns with a specified error tolerance. This ability to compensate for real world sensor errors makes approximate pattern matching an ideal choice for a wide range of applications including fingerprint, picture and bar-code identification, industrial automation, robotics and bioinformatics. This paper show...